Max-Min Fairness in Input-Queued Switches
نویسندگان
چکیده
This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.
منابع مشابه
Max-Min Fair Input-Queued Switching
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-ofservice attacks, and serve as a critical component of a quality-ofservice strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. While fairness in bandwidth ...
متن کاملA Framework for Evaluating Fairness in Input-Queued Switches: Fundamental Principles and Practical Strategies
Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. Several research efforts h...
متن کاملJoint Buffer Management and Scheduling for Input Queued Switches
JOINT BUFFER MANAGEMENT AND SCHEDULING FOR INPUT QUEUED SWITCHES by Dequan Liu Input queued (IQ) switches are highly scalable and they have been the focus of many studies from academia and industry. Many scheduling algorithms have been proposed for IQ switches. However, they do not consider the buffer space requirement inside an IQ switch that may render the scheduling algorithms inefficient in...
متن کاملA combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch
Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...
متن کاملFair Scheduling in Input-Queued Switches
Input-queued switch architecture has become attractive in the context of high performance networking because the switching fabric and the buffer need not run at a multiple (speedup) of the external link’s rate. With the expanding of network applications, the networks should provide QoS guarantees and QoS control is becoming a major issue in 1the design of high-performance switches. The scheduli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005